GPU-based adaptive compacting neighborhood tabu search for hardware/software partitioning
نویسندگان
چکیده
منابع مشابه
Tabu Search on GPU
Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of the CPU and can be increased by proper use of the GPGPU, i.e. General-Purpose Computation Using Graphics Hardware. Modern graphics hardware, initially developed for computer graphics generation, appeared to be flexible...
متن کاملGraph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملConvergent Tabu Search for Optimal Partitioning
We consider a specialization of tabu search for optimal partitioning problems, which can be used to model a wide variety of binary discrete optimization problems. Our method constitutes a form of tree search that applies under more general assumptions than standard tree search approaches. Moreover, the method allows combinations of problem restriction and problem relaxation strategies that are ...
متن کاملMultilevel Reactive Tabu Search for Graph Partitioning
In this paper, new multilevel heuristics are proposed for nding a balanced bipartition of a graph. Multilevel schemes have been recently introduced for quickly solving the problem on graphs with thousands of nodes, graphs often present in domain-decomposition techniques for parallel computing. These heuristics rstly reduce the original graph by collapsing its nodes and arcs, thus generating a h...
متن کاملNeighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as “walks through neighborhoods” where the walks are performed by iterative procedures that allow to move from a solution to another one in the solution space. In these heuristics, designing operators to explore large promi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Informationis
سال: 2018
ISSN: 1674-7267
DOI: 10.1360/n112017-00024